Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
نویسندگان
چکیده
In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NPcomplete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize the makespan.
منابع مشابه
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by χ=(G). In this paper the problem of determinig χ= for coronas of cubic graphs is studied. Although the prob...
متن کاملEquitable Colorings of l-Corona Products of Cubic Graphs
A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by χ=(G). In this paper the problem of determinig the value of equitable chromatic number for multic...
متن کاملEquitable total coloring of corona of cubic graphs
The minimum number of total independent sets of V ∪ E of graph G(V,E) is called the total chromatic number of G, denoted by χ′′(G). If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V ∪E is called the equitable total chromatic number, and denoted by χ′′ =(G). In this paper we consider equitable total c...
متن کاملEquitable coloring of graphs. Recent theoretical results and new practical algorithms∗§
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we ...
متن کاملEquitable Coloring of Corona Products of Graphs
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper, we consider an equitable coloring of some corona products H G of two graphs G and H. In particular, we show that deciding the colorability of H G is NP-complete even if G is 4-regular and H is . 2 K Next, we prove exact values or upper bounds on the equ...
متن کامل